Meta-Generalization for Multiparty Privacy Learning to Identify Anomaly Multimedia Traffic in Graynet

Identifying anomaly multimedia traffic in cyberspace is a big challenge in distributed service systems, multiple generation networks and future internet of everything. This letter explores meta-generalization for a multiparty privacy learning model in graynet to improve the performance of anomaly multimedia traffic identification. The multiparty privacy learning model in graynet is a globally shared model that is partitioned, distributed and trained by exchanging multiparty parameters updates with preserving private data. The meta-generalization refers to discovering the inherent attributes of a learning model to reduce its generalization error. In experiments, three meta-generalization principles are tested as follows. The generalization error of the multiparty privacy learning model in graynet is reduced by changing the dimension of byte-level imbedding. Following that, the error is reduced by adapting the depth for extracting packet-level features. Finally, the error is reduced by adjusting the size of support set for preprocessing traffic-level data. Experimental results demonstrate that the proposal outperforms the state-of-the-art learning models for identifying anomaly multimedia traffic.Comment: Correct some typo

Towards Smooth and High-Quality Bitrate Adaptation for HTTP Adaptive Streaming

Although HTTP adaptive streaming has been well documented for the cost-effective delivery of video streaming, it is still a great challenge to play back video smoothly with high quality under the fluctuating network conditions. In this paper, we proposed a novel bitrate adaptation algorithm for HTTP adaptive streaming. Our algorithm employed two approaches for throughput estimation and bitrate selection, which was evaluated on our testbed (a fully functional HTTP Live Streaming system) over a network, emulated using DummyNet. First, the throughput estimation method, based on the prediction of the difference between the estimated and instantaneous throughputs, was observed to respond smoothly to short-term fluctuations and rapidly to large fluctuations. Second, the bitrate selection algorithm, based on piecewise functions to define the variation range of the current bitrate, was found to result in smoother changes in quality with a higher average quality. The results of our experiments demonstrated the prospects of our bitrate adaptation algorithm for HTTP adaptive streaming

Validation of the Cardiosphere Method to Culture Cardiac Progenitor Cells from Myocardial Tissue

At least four laboratories have shown that endogenous cardiac progenitor cells (CPCs) can be grown directly from adult heart tissue in primary culture, as cardiospheres or their progeny (cardiosphere-derived cells, CDCs). Indeed, CDCs are already being tested in a clinical trial for cardiac regeneration. Nevertheless, the validity of the cardiosphere strategy to generate CPCs has been called into question by reports based on variant methods. In those reports, cardiospheres are argued to be cardiomyogenic only because of retained cardiomyocytes, and stem cell activity has been proposed to reflect hematological contamination. We use a variety of approaches (including genetic lineage tracing) to show that neither artifact is applicable to cardiospheres and CDCs grown using established methods, and we further document the stem cell characteristics (namely, clonogenicity and multilineage potential) of CDCs.CPCs were expanded from human endomyocardial biopsies (n = 160), adult bi-transgenic MerCreMer-Z/EG mice (n = 6), adult C57BL/6 mice (n = 18), adult GFP(+) C57BL/6 transgenic mice (n = 3), Yucatan mini pigs (n = 67), adult SCID beige mice (n = 8), and adult Wistar-Kyoto rats (n = 80). Cellular yield was enhanced by collagenase digestion and process standardization; yield was reduced in altered media and in specific animal strains. Heparinization/retrograde organ perfusion did not alter the ability to generate outgrowth from myocardial sample. The initial outgrowth from myocardial samples was enriched for sub-populations of CPCs (c-Kit(+)), endothelial cells (CD31(+), CD34(+)), and mesenchymal cells (CD90(+)). Lineage tracing using MerCreMer-Z/EG transgenic mice revealed that the presence of cardiomyocytes in the cellular outgrowth is not required for the generation of CPCs. Rat CDCs are shown to be clonogenic, and cloned CDCs exhibit spontaneous multineage potential.This study demonstrates that direct culture and expansion of CPCs from myocardial tissue is simple, straightforward, and reproducible when appropriate techniques are used

Dedifferentiation and Proliferation of Mammalian Cardiomyocytes

It has long been thought that mammalian cardiomyocytes are terminally-differentiated and unable to proliferate. However, myocytes in more primitive animals such as zebrafish are able to dedifferentiate and proliferate to regenerate amputated cardiac muscle.Here we test the hypothesis that mature mammalian cardiomyocytes retain substantial cellular plasticity, including the ability to dedifferentiate, proliferate, and acquire progenitor cell phenotypes. Two complementary methods were used: 1) cardiomyocyte purification from rat hearts, and 2) genetic fate mapping in cardiac explants from bi-transgenic mice. Cardiomyocytes isolated from rodent hearts were purified by multiple centrifugation and Percoll gradient separation steps, and the purity verified by immunostaining and RT-PCR. Within days in culture, purified cardiomyocytes lost their characteristic electrophysiological properties and striations, flattened and began to divide, as confirmed by proliferation markers and BrdU incorporation. Many dedifferentiated cardiomyocytes went on to express the stem cell antigen c-kit, and the early cardiac transcription factors GATA4 and Nkx2.5. Underlying these changes, inhibitory cell cycle molecules were suppressed in myocyte-derived cells (MDCs), while microRNAs known to orchestrate proliferation and pluripotency increased dramatically. Some, but not all, MDCs self-organized into spheres and re-differentiated into myocytes and endothelial cells in vitro. Cell fate tracking of cardiomyocytes from 4-OH-Tamoxifen-treated double-transgenic MerCreMer/ZEG mouse hearts revealed that green fluorescent protein (GFP) continues to be expressed in dedifferentiated cardiomyocytes, two-thirds of which were also c-kit(+).Contradicting the prevailing view that they are terminally-differentiated, postnatal mammalian cardiomyocytes are instead capable of substantial plasticity. Dedifferentiation of myocytes facilitates proliferation and confers a degree of stemness, including the expression of c-kit and the capacity for multipotency

Two Optimization Algorithms for Name-Resolution Server Placement in Information-Centric Networking

Information-centric networking (ICN) is an emerging network architecture that has the potential to address demands related to transmission latency and reliability in fifth-generation (5G) communication technology and the Internet of Things (IoT). As an essential component of ICN, name resolution provides the capability to translate identifiers into locators. Applications have different demands on name-resolution latency. To meet the demands, deploying name-resolution servers at the edge of the network by dividing it into multilayer overlay networks is effective. Moreover, optimization of the deployment of distributed name-resolution servers in such networks to minimize deployment costs is significant. In this paper, we first study the placement problem of the name-resolution server in ICN. Then, two algorithms called IIT-DOWN and IIT-UP are developed based on the heuristic ideas of inter-layer information transfer (IIT) and server reuse. They transfer server placement information and latency information between adjacent layers from different directions. Finally, experiments are conducted on both simulation networks and a real-world dataset. The experimental results reveal that the proposed algorithms outperform state-of-the-art algorithms such as the latency-aware hierarchical elastic area partitioning (LHP) algorithm in finding more cost-efficient solutions with a shorter execution time